CS 261 : A Second Course in Algorithms
نویسنده
چکیده
A popular myth is that, for NP -hard problems, there are no algorithms with worst-case running time better than that of brute-force search. Reality is more nuanced, and for many natural NP -hard problems, there are algorithms with (worst-case) running time much better than the naive brute-force algorithm (albeit still exponential). This lecture proves this point by revisiting three problems studied in previous lectures: vertex cover, the traveling salesman problem, and 3-SAT.
منابع مشابه
CS 261 : A Second Course in Algorithms Lecture # 5 : Minimum - Cost Bipartite Matching ∗
Last lecture introduced the maximum-cardinality bipartite matching problem. Recall that a bipartite graph G = (V ∪ W,E) is one whose vertices are split into two sets such that every edge has one endpoint in each set (no edges internal to V or W allowed). Recall that a matching is a subset M ⊆ E of edges with no shared endpoints (e.g., Figure 1). Last lecture, we sketched a simple reduction from...
متن کاملCOS 521: A Graduate Course in Algorithm Design and Analysis
These are lecture notes from a graduate course for Computer Science graduate students at Princeton University in Fall 2013 and Fall 2014. (The course also attracts undergrads and non-CS grads and total enrollment in 2014 was 35.) The course assumes prior knowledge of algorithms at the undergraduate level. This new course arose out of thinking about the right algorithms training for CS grads tod...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملCS 261 : A Second Course in Algorithms Lecture # 15 : Introduction to Approximation Algorithms ∗
All of CS161 and the first half of CS261 focus on problems that can be solved in polynomial time. A sad fact is that many practically important and frequently occurring problems do not seem to be polynomial-time solvable, that is, are NP -hard. As an algorithm designer, what does it mean if a problem is NP -hard? After all, a real-world problem doesn’t just go away after you realize that it’s N...
متن کاملHybridization of Cuckoo Search and Firefly Algorithms to Calculate the Interaction Parameters in Phase Equilibrium Modeling Problems
Liquid-liquid equilibrium (LLE) problems such as phase stability analysis, phase equilibrium calculations, chemical equilibrium calculations, binary interaction parameter identification of thermodynamic models and other problems of fluid characterization have been the core subject of many recent studies. This study introduces Cuckoo Search (CS), Firefly Algorithms (FA) and its variants as p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016